New models for shortest path problem with fuzzy arc lengths
نویسندگان
چکیده
This paper considers the shortest path problem with fuzzy arc lengths. According to different decision criteria, the concepts of expected shortest path, a-shortest path and the most shortest path in fuzzy environment are originally proposed, and three types of models are formulated. In order to solve these models, a hybrid intelligent algorithm integrating simulation and genetic algorithm is provided and some numerous examples are given to illustrate its effectiveness. 2005 Elsevier Inc. All rights reserved.
منابع مشابه
ALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS
We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...
متن کاملUncertain Programming Models for Shortest Path Problem with Uncertain Arc Lengths
Shortest path problem is a fundamental problem in network optimization and combinational optimization. The existing literature mainly concerned with the problem in deterministic, stochastic or fuzzy environments by using different tools. Different from the existing works, we investigate shortest path problem by regarding arc lengths as uncertain variables which are employed to describe the beha...
متن کاملShortest Path Problem with Gamma Probability Distribution Arc Length
We propose a dynamic program to find the shortest path in a network having gamma probability distributions as arc lengths. Two operators of sum and comparison need to be adapted for the proposed dynamic program. Convolution approach is used to sum two gamma probability distributions being employed in the dynamic program.
متن کاملInterval Type 2 Fuzzy Set in Fuzzy Shortest Path Problem
The shortest path problem (SPP) is one of the most important combinatorial optimization problems in graph theory due to its various applications. The uncertainty existing in the real world problems makes it difficult to determine the arc lengths exactly. The fuzzy set is one of the popular tools to represent and handle uncertainty in information due to incompleteness or inexactness. In most cas...
متن کاملA New Approach for Solving Type-2 Fuzzy Shortest Path Problem
Abstract. In a network the arc lengths may represent time or cost. In practical situations, it is reasonable to assume that each arc length is a type-2 discrete fuzzy set. We called it the type-2 discrete fuzzy shortest path problem. In this paper we proposed an algorithm for finding shortest path and shortest path length from source node to destination node using type reduction method. We have...
متن کامل